The generalized S-graphs of diameter 3
نویسندگان
چکیده
منابع مشابه
On the diameter of generalized Kneser graphs
Let r , k be positive integers, s(< r), a nonnegative integer, and n=2r−s+k. The set of r-subsets of [n]={1, 2, . . . , n} is denoted by [n]r . The generalized Kneser graphK(n, r, s) is the graph whose vertex-set is [n]r where two r-subsets A and B are joined by an edge if |A ∩ B| s. This note determines the diameter of generalized Kneser graphs. More precisely, the diameter of K(n, r, s) is eq...
متن کاملOriented diameter of graphs with diameter 3
In 1978, Chvátal and Thomassen proved that every 2-edge-connected graph with diameter 2 has an orientation with diameter at most 6. They also gave general bounds on the smallest value f(d) such that every 2-edge-connected graph G with diameter d has an orientation with diameter at most f(d). For d = 3, their general bounds reduce to 8 ≤ f(3) ≤ 24. We improve these bounds to 9 ≤ f(3) ≤ 11.
متن کاملWide Diameter of Generalized Petersen Graphs
Generalized Petersen graphs are commonly used interconnection networks, and wide diameter is an important parameter to measure fault-tolerance and efficiency of parallel processing computer networks. In this paper, we show that the diameter and 3-wide diameter of generalized Petersen graph P (m,a) are both O( m 2a ), where a ≥ 3.
متن کاملGeneralized eccentricity, radius, and diameter in graphs
For a vertex v and a (k−1)-element subset P of vertices of a graph, one can define the distance from v to P in various ways, including the minimum, average, and maximum distance from v to P . Associated with each of these distances, one can define the keccentricity of the vertex v as the maximum distance over all P , and the k-eccentricity of the set P as the maximum distance over all v. If k =...
متن کاملOn Diameter of Line Graphs
The diameter of a connected graph $G$, denoted by $diam(G)$, is the maximum distance between any pair of vertices of $G$. Let $L(G)$ be the line graph of $G$. We establish necessary and sufficient conditions under which for a given integer $k geq 2$, $diam(L(G)) leq k$.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1995
ISSN: 0012-365X
DOI: 10.1016/0012-365x(93)e0130-v